Location:
Search - prim algorithm
Search list
Description: 最小生成树的prim算法
是求图中的最短路径的一个重要算法
但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm
Platform: |
Size: 3145 |
Author: 袁文 |
Hits:
Description: 很有意思的网线布局的编程，用到了prim算法。完全原创！课程设计时的作品-very interesting line distribution network programming, a prim algorithm used. Completely original! Curriculum design works
Platform: |
Size: 305266 |
Author: 毕成功 |
Hits:
Description: Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes!
Platform: |
Size: 1432 |
Author: gao |
Hits:
Description: 利用prim算法来计算最小生成树,对于数据结构学习者有很大帮助,利用邻接矩阵来存储图-Prim algorithm used to calculate the minimum spanning tree, the data structure for the learner is very helpful to use the adjacency matrix storage plan
Platform: |
Size: 5891 |
Author: 赵麟 |
Hits:
Description: 一个最小生成树,包括prim算法,可以生成一个最小生成树-a minimum spanning tree, including Prim algorithm can generate a minimum spanning tree
Platform: |
Size: 1307 |
Author: 张立博 |
Hits:
Description: 用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non - recursive algorithm traversal function.
Platform: |
Size: 3916 |
Author: 贾德 |
Hits:
Description: 用普里姆(Prim)算法构造最小生成树 数据结构的基本应用，适合初学者-with Primbetov (PRIM), the minimum spanning tree algorithm tectonic structure of the basic data applications, suitable for beginners
Platform: |
Size: 2057 |
Author: 阿水 |
Hits:
Description: 图论算法库 C++ 语言实现
代码内容 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
语言 C++
编译平台 VisualAge C++ 4.0
作者 starfish (starfish.h@china.com)
备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod - Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM / Illinois prepared to contest the information, because the competition for high speed
Platform: |
Size: 10202 |
Author: 罗鹏魁 |
Hits:
Description: 数据结构中的Prim算法
本人自己编的
望大家给与支持-data structure of Prim algorithm I hope his series of the support we give
Platform: |
Size: 6845 |
Author: 周娜娜 |
Hits:
Description: 这是一个程序算法,主要描述的上PRIM算法,用C编写的-this a procedural algorithm, described in the main on PRIM algorithm, used in the preparation of C! !
Platform: |
Size: 20913 |
Author: wqw |
Hits:
Description: C语言实现普里姆算法 根据无向网构造最小生成树-C language implementation Prim algorithm based on minimum spanning tree in undirected network structure
Platform: |
Size: 2048 |
Author: haan36u195 |
Hits:
Description: 使用prim算法生成最小生成树，并输出矩阵-The use of prim algorithm to generate the minimum spanning tree, and the output matrix
Platform: |
Size: 310272 |
Author: 林翔 |
Hits:
Description: 普里姆（Prim）算法是一种构造性算法。用于求最小生成树。-Prim algorithm is used for solving the minimum spanning tree.
Platform: |
Size: 2048 |
Author: 小小 |
Hits:
Description: 经典的prim算法，采用贪心策略，求一个给定的加权连通图的最小生成树。-
The classic prim algorithm, using the greedy strategy, for a given weighted connected graph of the minimum spanning tree.
Platform: |
Size: 173056 |
Author: sr |
Hits:
Description: 在本文章里面，有各种举出算法的C语言实现
1、大数阶乘
2、大数乘法
3、任意进制转换
4、最大公约数
5、最小公倍数
6、快速傅里叶变换
7，字符串的替换，查找，截取
8、叉乘法求多边形的面积
9、快速，希尔，选择等各种排序
10、二叉树，链表，链栈
11、二分查找
12、求解线性方程组，也叫中国余数定理
13、求点到直线距离
14、Prim算法求最小生成器
15、判断点与直线的关系，俩条直线的关系
16、求排列组合数，俩矢量角度
......
等等基础算法的C语言代码实现-1, large factorial
2, a large number of multiplication
3, arbitrary binary conversion
4, the largest common divisor
5, the least common multiple
6, fast Fourier transform
7, string replacement, search, interception
8, fork multiplication method for polygon area
9, fast, Hill, choice and other sort
10, binary tree, linked list, chain stack
11, binary search
12, solving linear equations, also known as the Chinese remainder theorem
13, seeking point to a straight line distance
14, Prim algorithm for the minimum generator
15, determine the point and the relationship between the two lines of the relationship
16, the number of permutations and combinations, two vector angle
...
And so on the basis of the C language code algorithm
Platform: |
Size: 1247232 |
Author: 刘楠 |
Hits:
Description: Prim algorithm by Visual C++
Input Node, line number
and input start node, end node, line value
Platform: |
Size: 663552 |
Author: Phil |
Hits:
Description: 自来水管道架设问题
【问题描述】
若要在八个居民区（A区、B区、C区、D区、E区、F区、G区、H区）之间架设自来水管道，如何以最低的经济代价架设这个自来水管道。
【基本要求】
利用二种方法Prim算法和克鲁斯卡尔Kruskal算法生成自来水管道的架设方案(Two methods, Prim algorithm and Cruise Carle Kruskal algorithm are used to generate the water pipe erection scheme)
Platform: |
Size: 2048 |
Author: ls291730
|
Hits:
Description: prim算法求最小生成树
matlab代码例子(calculate minimum spanning tree using prim algorithm)
Platform: |
Size: 11264 |
Author: jono_bai
|
Hits:
Description: prim算法生成最小生成树，得出算法生成结果并输出到控制台。(Prim algorithm generates minimum spanning tree, the algorithm generates results and output to the console.)
Platform: |
Size: 2048 |
Author: PoisonLam
|
Hits:
Description: 问题描述：给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。
基本要求：
1、城市间的距离网采用邻接矩阵表示，邻接矩阵的存储结构定义采用课本中给出的定义，若两个城市之间不存在道路，则将相应边的权值设为自己定义的无穷大值。要求在屏幕上显示得到的最小生成树中包括了哪些城市间的道路，并显示得到的最小生成树的代价。
2、表示城市间距离网的邻接矩阵（要求至少6个城市，10条边）
3、最小生成树中包括的边及其权值，并显示得到的最小生成树的代价。(Problem Description: given the distance network between n cities in a region, the minimum spanning tree is established by prim algorithm or Kruskal algorithm, and the cost of the minimum spanning tree is calculated.
Basic requirements:
1. The distance network between cities is represented by adjacency matrix, and the definition of adjacency matrix storage structure is given in the textbook. If there is no road between two cities, the weight of the corresponding edge is set to its own infinite value. It is required to display the roads between cities in the minimum spanning tree and the cost of the minimum spanning tree.
2. Adjacency matrix representing distance network between cities (at least 6 cities and 10 edges are required)
3. The minimum spanning tree includes the edges and their weights, and shows the cost of the minimum spanning tree.)
Platform: |
Size: 237568 |
Author: Layman俗人 |
Hits:
«
1
2
3
4
5
6
78
9
10
11
12
...
21
»